Distributed Coding Using Punctured Quasi-Arithmetic Codes for Memory and Memoryless Sources
نویسندگان
چکیده
منابع مشابه
Distributed Joint Source-Channel Coding for arbitrary memoryless correlated sources and Source coding for Markov correlated sources using LDPC codes
In this paper, we give a distributed joint source channel coding scheme for arbitrary correlated sources for arbitrary point in the Slepian-Wolf rate region, and arbitrary link capacities using LDPC codes. We consider the Slepian-Wolf setting of two sources and one destination, with one of the sources derived from the other source by some correlation model known at the decoder. Distributed enco...
متن کاملDistributed Source Coding for Correlated Memoryless Gaussian Sources
We consider a distributed source coding problem of L correlated Gaussian observations Yi, i = 1, 2, · · · , L. We assume that the random vector Y L = t(Y1, Y2, · · · , YL) is an observation of the Gaussian random vector X = t(X1, X2, · · · , XK), having the form Y L = AX +N , where A is a L×K matrix and N = t(N1, N2, · · · , NL) is a vector of L independent Gaussian random variables also indepe...
متن کاملPunctured Elias Codes for variable-length coding of the integers
The compact representation of integers is an important problem in areas such as data compression, especially where there is a nearly monotonic decrease in the likelihood of larger integers. While many different representations have been described, it is not always clear in which circumstances a particular code is to be preferred. This report introduces a variant of the Elias γ code which is sho...
متن کاملLow-complexity sequential lossless coding for piecewise-stationary memoryless sources
Three strongly sequential, lossless compression schemes, one with linearly growing per-letter computational complexity, and two with fixed per-letter complexity, are presented and analyzed for memoryless sources with abruptly changing statistics. The first method, which improves on Willems’ weighting approach, asymptotically achieves a lower bound on the redundancy, and hence is optimal. The se...
متن کاملDistributed Joint Source-Channel Coding for Correlated Sources Using Non-systematic Repeat-Accumulate Based Codes
In this paper, we propose a technique for coding the data from multiple correlated binary sources, with the aim of providing an alternative solution to the correlated source compression problem. Using non-systematic repeat-accumulate based codes, it is possible to achieve compression which is close to the Slepian–Wolf bound without relying on massive puncturing. With the technique proposed in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2009
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2009.2023359